No. 2010–47 AN ODD CHARACTERIZATION OF THE GENERALIZED ODD GRAPHS
نویسندگان
چکیده
We show that any connected regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is distance-regular, and in particular that it is a generalized odd graph. 2010 Mathematics Subject Classification: 05E30, 05C50; JEL Classification System: C0
منابع مشابه
Further results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملSkolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملAn odd characterization of the generalized odd graphs
Article history: Received 27 April 2010 Available online 17 March 2011
متن کاملFuzzy subgroups of the direct product of a generalized quaternion group and a cyclic group of any odd order
Bentea and Tu{a}rnu{a}uceanu~(An. c{S}tiinc{t}. Univ. Al. I.Cuza Iac{s}, Ser. Nouv{a}, Mat., {bf 54(1)} (2008), 209-220)proposed the following problem: Find an explicit formula for thenumber of fuzzy subgroups of a finite hamiltonian group of type$Q_8times mathbb{Z}_n$ where $Q_8$ is the quaternion group oforder $8$ and $n$ is an arbitrary odd integer. In this paper weconsider more general grou...
متن کاملEven-cycle decompositions of graphs with no odd-K4-minor
An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition. Seymour (1981) proved that every 2-connected loopless Eulerian planar graph with an even number of edges also admits an even-cycle decomposition. Later, Zhang (1994) generalized this to graphs with no K5-minor. Our main theorem gi...
متن کامل